Topological ubiquity of trees

نویسندگان

چکیده

Let ⊲ be a relation between graphs. We say graph G is -ubiquitous if whenever Γ with n for all ∈ N , then one also has ℵ 0 where αG the disjoint union of α many copies . The Ubiquity Conjecture Andreae, well-known open problem in theory infinite graphs, asserts that every locally finite connected ubiquitous respect to minor relation. In this paper we show trees are topological relation, irrespective their cardinality. This answers question Andreae from 1979.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Unifying Perception and Cognition: The Ubiquity of Trees

Is there a single mechanism that underlies all perceptual and cognitive processing? This paper aims to solve a small part of Newell's challenge (A. Newell 1990, Unified Theories of Cognition, Harvard University Press) and proposes a model that unifies three different modalities: language, music and problem-solving. In doing so, we will focus on tree structures. Trees are ubiquitous in modeling ...

متن کامل

Topological indices of Kragujevac trees

We find the extremal values of the energy, the Wiener index and several vertex-degree-based topological indices over the set of Kragujevac trees with the central vertex of fixed degree. 2010 Mathematics Subject Classification : 05C90, 05C35.

متن کامل

Topological properties of cellular automata on trees

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k ≥ 2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

متن کامل

The Ubiquity of Discovery

As scientists ~rnterested in studying the phenomenon of"inteUigence", we first choose a view of Man, develop a theory of how intelligent behavior is managed, and construct some models which can test and refine that theory. The view we choose is that Man is a precessor of symbolic infomlation. The theory is that sophisticated cognitive tasks can be cast as searches or explorations, and that each...

متن کامل

Ubiquity of Kostka Polynomials

We report about results revolving around Kostka–Foulkes and parabolic Kostka polynomials and their connections with Representation Theory and Combinatorics. It appears that the set of all parabolic Kostka polynomials forms a semigroup, which we call Liskova semigroup. We show that polynomials frequently appearing in Representation Theory and Combinatorics belong to the Liskova semigroup. Among ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2022

ISSN: ['0095-8956', '1096-0902']

DOI: https://doi.org/10.1016/j.jctb.2022.05.011